Minimum-cost flow problem - PDFSEARCH.IO - Document Search Engine

Minimum-cost flow problem
Results: 17

#	Item
11	Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing Ravishankar Krishnaswamy∗ Viswanath Nagarajan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-12 10:28:36 Combinatorics Combinatorial optimization Flow network Cluster analysis Max-flow min-cut theorem Cut Minimum-cost flow problem Maximum flow problem CURE data clustering algorithm Graph theory Network flow Mathematics
12	Earth Mover’s Distance based Similarity Search at Scale Yu Tang† , Leong Hou U‡ , Yilun Cai† , Nikos Mamoulis† , Reynold Cheng† † † {ytang, Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-11-07 15:10:21 Theoretical computer science Shortest path problem Histogram Maximum flow problem Flow network Minimum-cost flow problem Matching Mathematics Graph theory Network flow
13	Microsoft Word - minreg-fmcad-final3.doc Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2007-07-30 11:41:26 Combinatorial optimization Formal methods Combinatorics Retiming Maximum flow problem Flow network Minimum cut Cut Minimum-cost flow problem Network flow Graph theory Mathematics
14	Constructing Optimal Solutions to the Minimum Cost 2-edge-connected Spanning Subgraph Problem Sylvia Boyd Paul Elliott-Magwood Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2006-04-28 12:37:31 Graph connectivity Ear decomposition Max-flow min-cut theorem Graph Cut Spanning tree Graph theory Mathematics Combinatorial optimization
15	ACADEMIA DE TRANSPORTURI, Add to Reading List Source URL: www.aticmd.md Language: English - Date: 2012-03-29 13:16:44 Mathematics Applied mathematics Mathematical sciences Network flow Flow network Minimum-cost flow problem
16	November[removed]LIDS-P-2276 RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems Add to Reading List Source URL: web.mit.edu Language: English - Date: 2001-07-10 15:50:54 Systems scientists Network flow Operations research Convex optimization Auction algorithm Dimitri Bertsekas Interior point method Minimum-cost flow problem Shortest path problem Mathematics Applied mathematics Mathematical optimization
17	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Paul Christiano Add to Reading List Source URL: math.mit.edu Language: English - Date: 2010-10-19 15:39:13 Combinatorics Maximum flow problem Flow network Minimum cut Minimum-cost flow problem Cut Max-flow min-cut theorem Ford–Fulkerson algorithm Network flow Graph theory Mathematics

UPDATE